Online construction of subsequence automata for multiple texts by Hiromasa Hoshino , Ayumi Shinohara , Masayuki

Online construction of subsequence automata for multiple texts by Hiromasa Hoshino

We consider a deterministic finite automaton which accepts all subsequences of a set of texts, called subsequence automaton. We show an online algorithm for constructing subsequence automaton for a set of texts. It runs in O(|Σ|(m + k) + N) time using O(|Σ|m) space, where |Σ| is the size of alphabet, m is the size of the resulting subsequence automaton, k is the number of texts, N is the total ...

Online Construction of Subsequence Automata for Multiple Texts

We consider a deterministic finite automaton which accepts all subsequences of a set of texts, called subsequence automaton. We show an online algorithm for constructing subsequence automaton for a set of texts. It runs in O(|Σ|(m+ k) +N) time using O(|Σ|m) space, where |Σ| is the size of alphabet, m is the size of the resulting subsequence automaton, k is the number of texts, and N is the tota...

A Practical Algorithm to Find the Best Subsequence Patterns

Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We generalize the problem to an optimization problem, and give a practical algorithm to solve it exactly. Our algorithm uses pruning heuristic and subsequence automata, and can find the best subsequence. We show some experime...

A Practical Algorithm to Find Best Subsequence Patterns

Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We generalize the problem to an optimization problem, and give a practical algorithm to solve it exactly. Our algorithm uses pruning heuristic and subsequence automata, and can find the best subsequence. We show some prelimin...

Constru tion of the CDAWG for a Trie